Steady-State Queue Length Analysis of a Batch Arrival Queue under N-Policy with Single Vacation and Setup Times

This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length V . When he returns, if the queue length reaches or exceeds threshold ( 1) N N  , the server is immediately turned on but is temporarily unavailable due to a random setup time U before offering service. If not, the server stays in the system until the queue length at least being N . We derive the system size distribution and confirm the stochastic decomposition property. We also derive the recursion expressions of queue length distribution and other performance measures. Finally, we present some numerical examples to show the analytical results obtained. Sensitivity analysis is also performed.